On the Some New Synthetic Fibers
نویسندگان
چکیده
منابع مشابه
on the comparison of keyword and semantic-context methods of learning new vocabulary meaning
the rationale behind the present study is that particular learning strategies produce more effective results when applied together. the present study tried to investigate the efficiency of the semantic-context strategy alone with a technique called, keyword method. to clarify the point, the current study seeked to find answer to the following question: are the keyword and semantic-context metho...
15 صفحه اولFlexural Behavior of Cementitious Composites Reinforced by Synthetic Fibers
The application of fibers to reinforce cementitious materials is a well-known subject. At first, asbestos fibers are used in industrial process to produce fiber reinforced cement sheets. Thereafter, various types of synthetic fibers are produced and used as asbestos substitutes. The aim of the present work is to evaluate the effect of synthetic fibers on the flexural behavior of cementitious co...
متن کاملSynthesis and New Synthetic Utility of some (Hetero)aryl Azido Compounds under Thermal and Ultrasonic Irradiation
Some aryl and heteroaryl azido compounds were synthesized from the reaction of corresponding fluoro and chloro compounds with sodium azide in DMF as solvent and under various reaction conditions especially ultrasonic irradiation. Reaction of aromatic and heteroaromatic azido compound with thioacetic acid in the presence of sodium hydrogen carbonate and in methanol as solvent led to the differen...
متن کاملSome New Results On the Hosoya Polynomial of Graph Operations
The Wiener index is a graph invariant that has found extensive application in chemistry. In addition to that a generating function, which was called the Wiener polynomial, who’s derivate is a q-analog of the Wiener index was defined. In an article, Sagan, Yeh and Zhang in [The Wiener Polynomial of a graph, Int. J. Quantun Chem., 60 (1996), 959969] attained what graph operations do to the Wiene...
متن کاملSome new bounds on the general sum--connectivity index
Let $G=(V,E)$ be a simple connectedgraph with $n$ vertices, $m$ edges and sequence of vertex degrees$d_1 ge d_2 ge cdots ge d_n>0$, $d_i=d(v_i)$, where $v_iin V$. With $isim j$ we denote adjacency ofvertices $v_i$ and $v_j$. The generalsum--connectivity index of graph is defined as $chi_{alpha}(G)=sum_{isim j}(d_i+d_j)^{alpha}$, where $alpha$ is an arbitrary real<b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sen'i Gakkaishi
سال: 1955
ISSN: 0037-9875,1884-2259
DOI: 10.2115/fiber.11.588